A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 - (Extended Abstract)
نویسندگان
چکیده
We characterize the hitting sets for read-once branching programs of width 3 by a so-called richness condition which is independent of a rather technical definition of branching programs. The richness property proves to be (in certain sense) necessary and sufficient condition for such hitting sets. In particular, we show that any rich set extended with all strings within Hamming distance of 3 is a hitting set for width-3 read-once branching programs. Applying this result to an example of an efficiently constructible rich set from our previous work we achieve an explicit polynomial time construction of an ε-hitting set for read-once branching programs of width 3 with acceptance probability ε > 11/12.
منابع مشابه
A Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width
Recently, an interest in constructing pseudorandom or hitting set generators for restricted branching programs has increased, which is motivated by the fundamental issue of derandomizing space-bounded computations. Such constructions have been known only in the case of width 2 and in very restricted cases of bounded width. In this paper, we characterize the hitting sets for read-once branching ...
متن کاملA Polynomial Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
The relationship between deterministic and probabilistic computations is one of the central issues in complexity theory. This problem can be tackled by constructing polynomial time hitting set generators which, however, belongs to the hardest problems in computer science even for severely restricted computational models. In our work, we consider read-once branching programs for which such a con...
متن کاملAlmost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs
Recently, an interest in constructing pseudorandom or hitting set generators for restricted branching programs has increased, which is motivated by the fundamental problem of derandomizing space bounded computations. Such constructions have been known only in the case of width 2 and in very restricted cases of bounded width. In our previous work, we have introduced a so-called richness conditio...
متن کاملIdentity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
We give improved hitting sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known order of the variables. The best previously known hitting set for this case had size (nw)O(logn) where n is the number of variables and w is the width of the ROABP. Even for a constantwidth ROABP, nothing better than a quasi-polynomial bound ...
متن کاملIdentity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs
We give improved hitting-sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known variable order. The best previously known hitting-set for this case had size (nw) where n is the number of variables and w is the width of the ROABP. Even for a constant-width ROABP, nothing better than a quasi-polynomial bound was known. We ...
متن کامل